Lyman Copeland Draper: An Archivist's Reappraisal
نویسندگان
چکیده
منابع مشابه
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter α that describes how ties in head-to-head contests are valued. We show that the thus obtained problem of manipulation for unweighted Copeland elections is NP-complete even if the size of the manipulating coalition is limited to two. Our result holds for all rational ...
متن کاملProbabilistic Copeland Tournaments
INTRODUCTION We consider a probabilistic model of round-robin tournaments, or equivalently, Copeland voting, where candidates are the voters. We assume that the outcomes of each game or pairwise vote are jointly independent. In particular, we do not assume that votes arise from voters’ ranked orderings of candidates. We can treat such games as pairwise preferences, without assuming any form of ...
متن کاملCopeland Dueling Bandits
A version of the dueling bandit problem is addressed in which a Condorcet winner may not exist. Two algorithms are proposed that instead seek to minimize regret with respect to the Copeland winner, which, unlike the Condorcet winner, is guaranteed to exist. The first, Copeland Confidence Bound (CCB), is designed for small numbers of arms, while the second, Scalable Copeland Bandits (SCB), works...
متن کاملManipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland-manipulation for α ∈ {0, 1}. Copeland, 0 ≤ α ≤ 1, is an election system where for each pair of candidates we check which one is preferred by more voters (i.e., we conduct a head-to-head majority contest) and we give one point to this candidate and zero to the other. How...
متن کاملApplying Copeland Voting to Design an Agent-Based Hyper-Heuristic
Meta-heuristics are algorithms which are applied to solve problems when conventional algorithms can not find good solutions in reasonable time; evolutionary algorithms are perhaps the most well-known examples of meta-heuristics. As there are many possible meta-heuristics, finding the most suitable meta-heuristic for a given problem is not a trivial task. In order to make this choice, one can de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Archivist
سال: 1982
ISSN: 0360-9081
DOI: 10.17723/aarc.45.4.b1k2076n3t527v57